String Path Search Procedures for Data Base Systems

This paper structures algorithms for the translation of set theoretic queries into procedures for the search of arbitrary complex networks constructed on a data base using three basic types of strings. A method for parametrization of queries which is appropriate for accessing string structures is outlined and it is shown how the properties of string structures can be used to construct an algorithm for finding a search path with minimum path cardinality for a given query addressed to such a network. (The term data management system is used instead of data base management system.)